Four-valued Logics for Paraconsistent Reasoning

نویسندگان

  • Andreas Lang
  • Franz Kafka
چکیده

A drawback of many logics for reasoning on Semantic Web ontologies is the Principle of Explosion in case of inconsistent data. Considering a four-valued semantics, inconsistencies can be tolerated such that paraconsistency is obtained. We extend Belnap’s four-valued logic to a four-valued first-order logic with implication and equality, and we develop a method for translating formulas to a representation in classical first-order logic. This procedure allows paraconsistent reasoning in classical first-order logic. We transfer our results to a setting of Description Logics by defining four-valued versions of ALC and SHIQ. This lays the foundations for implementing paraconsistent reasoning for KRR systems that work with classical logics. We exemplify a realisation with respect to the ontology management infrastructure KAON2. The crucial idea is enabling KAON2 to merge ontologies and to perform reasoning tasks on the resulting ontology even if this ontology is inconsistent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Paraconsistent Reasoning for Expressive and Tractable Description Logics

Four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases, mainly ALC. This approach has a distinct advantage that it can be implemented by invoking classical reasoners to keep the same complexity as classical semantics. In this paper, we further study how to extend the four-valued semantics to more expressive description logics, such as...

متن کامل

Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency

Paradefinite (‘beyond the definite’) logics are logics that can be used for handling contradictory or partial information. As such, paradefinite logics should be both paraconsistent and paracomplete. In this paper we consider the simplest semantic framework for defining paradefinite logics, consisting of four-valued matrices, and study the better accepted logics that are induced by these matric...

متن کامل

Towards a Paradoxical Description Logic for the Semantic Web

As a vision for the future of the Web, the Semantic Web is an open, constantly changing and collaborative environment. Hence it is reasonable to expect that knowledge sources in the Semantic Web contain noise and inaccuracies. However, as the logical foundation of Ontology Web Language in the Semantic Web, description logics fail to tolerate inconsistent information. The study of inconsistency ...

متن کامل

Reasoning with Different Levels of Uncertainty

We introduce a family of preferential logics that are useful for handling information with different levels of uncertainty. The corresponding consequence relations are nonmonotonic, paraconsistent, adaptive, and rational. It is also shown that the formalisms in this family can be embedded in corresponding four-valued logics with at most three uncertainty levels, and that reasoning with these lo...

متن کامل

Paraconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories

Through minimal-model semantics, three-valued logics provide an interesting formalism for capturing reasoning from inconsistent information. However, the resulting paraconsistent logics lack so far a uniform implementation platform. Here, we address this and specifically provide a translation of two such paraconsistent logics into the language of quantified Boolean formulas (QBFs). These formul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006